The building evacuation problem with shared information

In this article, the Building Evacuation Problem with Shared Information (BEPSI) is formulated as a mixed integer linear program, where the objective is to determine the set of routes along which to send evacuees (supply) from multiple locations throughout a building (sources) to the exits (sinks) such that the total time until all evacuees reach the exits is minimized. The formulation explicitly incorporates the constraints of shared information in providing online instructions to evacuees, ensuring that evacuees departing from an intermediate or source location at a mutual point in time receive common instructions. Arc travel time and capacity, as well as supply at the nodes, are permitted to vary with time and capacity is assumed to be recaptured over time. The BEPSI is shown to be NP‐hard. An exact technique based on Benders decomposition is proposed for its solution. Computational results from numerical experiments on a real‐world network representing a four‐story building are given. Results of experiments employing Benders cuts generated in solving a given problem instance as initial cuts in addressing an updated problem instance are also provided. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

基于自适应累量算法的舰船轴频电场信号检测方法

提出一种新的舰船轴频电场信号检测方法.该方法利用高阶累量对高斯噪声的抑制作用,首先使用基于自适应累量算法的FIR滤波器对接收信号进行滤波消噪处理,以提高信噪比;然后再对滤波输出信号进行滑动功率谱检测.实测数据处理结果表明了该方法的稳健性和有效性.     

Supply chain coordination with shelf‐space and retail price dependent demand and heterogeneous retailers

We consider supply chain coordination in which a manufacturer supplies some product to multiple heterogeneous retailers and wishes to coordinate the supply chain via wholesale price and holding cost subsidy. The retail price is either exogenous or endogenous. The market demand is described by the market share attraction model based on all retailers'shelf‐spaces and retail prices. We obtain optimal solutions for the centralized supply chain, where the optimal retail pricing is a modified version of the well‐known cost plus pricing strategy. We further get feasible contracts for the manufacturer to coordinate the hybrid and decentralized supply chains. The manufacturer can allocate the total profit free to himself and the retail market via the wholesale price when the retail price is exogenous, but otherwise he cannot. Finally, we point out that different characteristics of the retail market are due to different powers of the manufacturer, and the more power the manufacturer has, the simpler the contract to coordinate the chain will be. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010     

试论经济力量向军事力量的转化

国家经济力量是军事力量的唯一源泉,军队的战斗力大小是军事力量强弱的重要标志,提高战斗力是军队一切工作的核心。但是,经济力量并不等于就是军事力量和战斗力,要把经济力量变为军队的战斗力还要经过一系列的转化过程。其整个转化过程可分为三个步骤,即经济力量向保障力量要素的转化;保障力量要素向保障能力的转化;保障能力向战斗力的转化。认真研究这些转化过程和转化环节,掌握其转化途径、方法和转化机制,对于促进和加快转化速度,提高转化效率和军队战斗力,具有十分重要的现实意义,是加强质量建军,实现两个根本转变和做好军事斗争准备的关键。     

硅整流无刷发电机供电系统动态性能的研究

分析了坦克的供电系统中采用硅整流无刷发电机时的工作特点,建立了这种系统的数学模型,举例说明了计算方法,并在文章的最后进行了评价.     

高功率微波对YBCO超导材料的改性

用固相反应法制备了123相YBCO超导块材。利用超导电性（Tc）测量、扫描电镜（SEM）等方法研究了高功率微波加载及退火处理对YBCO样品的影响。电阻－温度关系曲线表明,处理后的样品在超导起始转变温度Tco≈90K处由半导体型向超导转变,超导转变宽度△T增大。SEM结果显示,晶粒大大细化。作者认为,由于高功率微波对样品的瞬时高压作用,在样品中引入了阻碍磁通蠕动的钉扎中心,同时,退火处理改善了晶粒之间的弱连接,为提高临界电流密度Jc创造了条件。     

基于HLA的导弹攻防仿真系统分析与设计

基于HLA建立仿真应用系统是提高作战仿真活动效率的有效途径。分析了导弹攻防仿真系统的组成和特点,在联邦开发与执行过程模型(FEDEP)基础上,结合作者的开发经验,探讨了基于HLA的仿真应用系统开发的一般过程,将其总结为系统分析、联邦设计、FOM/SOM开发、联邦成员实现与联邦集成四个步骤。给出了某地地导弹与宙斯盾防御系统攻防仿真的系统设计实例。     

故障诊断和容错技术在控制系统中的应用研究

介绍了控制系统的故障诊断和容错控制的基本概念和任务 ,评述了故障诊断和容错控制技术所用的各种方法 ,并对故障诊断和容错控制技术在核动力装置控制系统中应用的可行性进行了探讨 .     

AR模型在陀螺仪性能故障诊断中的应用研究

对惯导系统上的陀螺仪在无故障和故障下输出的信号进行分析 ,计算出信号的特征量———均值、标准差、协方差 ,并用现代谱分析技术中参数模型功率谱分析的方法 ,建立信号的AR模型、绘出AR模型的功率谱图 ,对陀螺仪输出信号的变化进行了比较和分析 ,从而找出一种作为判断陀螺仪性能故障的依据     

Generating Pareto‐optimal boundary points in multiparty negotiations using constraint proposal method

In this paper a constraint proposal method is developed for computing Pareto‐optimal solutions in multiparty negotiations over continuous issues. Constraint proposal methods have been previously studied in a case where the decision set is unconstrained. Here we extend the method to situations with a constrained decision set. In the method the computation of the Pareto‐optimal solutions is decentralized so that the DMs do not have to know each others' value functions. During the procedure they have to indicate their optimal solutions on different sets of linear constraints. When the optimal solutions coincide, the common optimum is a candidate for a Pareto‐optimal point. The constraint proposal method can be used to generate either one Pareto‐optimal solution dominating the status quo solution or several Pareto‐optimal solutions. In latter case a distributive negotiation among the efficient points can be carried out afterwards. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 210–225, 2001